Home > Search Results: keywords:"pseudofinite structures|forcing|complexity|witnessing|TFNP|clique"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Pseudofinite structures and limits
 Ježil, Ondřej ; Krajíček, Jan (advisor) ; Šaroch, Jan (referee)
For a class of graph instances of a computational problem we define a limit object, relative to some computationally restricted class of functions. The key method here is forcing with random variables where the sample set is taken as instances of some nonstandard size. We study the general theory of these limits, called in the thesis wide limits, and their connection to classical problems such as finding a large clique or with the combinatorial problems associated with the classes of total NP search problems PPA and PPAD. Our main results are several 0-1 laws associated with these limits and existence of a significantly large clique of the wide limit of all graph consisting of one large clique. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English